Adaptive Strategies of MTD-f for Actual Games
نویسندگان
چکیده
MTD algorithm developed by Plaat is a variation of SSS* which uses the depth-first strategy to resolve the storage problem coming from the best-first strategy. Since MTD algorithm is based on the zero window search algorithm, the initial range of the searching windows plays an important role in the performance. In this paper, we show some basic experimental results of MTD algorithm. From considerations of the results, the performance of MTD algorithm is expected to be improved by the reduction of the number of times that zero window procedure is called. Then we propose two variations of MTD algorithm. Our purpose is the reduction of searching nodes by the setting of initial window ranges and the way of narrowing the range in the search. Experimental results show 6 percents improvement of searching nodes against MTD-f algorithm.
منابع مشابه
Evaluating Moving Target Defense with PLADD
This project evaluates the effectiveness of moving target defense (MTD) techniques using a new game we have designed, called PLADD, inspired by the game FlipIt [28]. PLADD extends FlipIt by incorporating what we believe are key MTD concepts. We have analyzed PLADD and proven the existence of a defender strategy that pushes a rational attacker out of the game, demonstrated how limited the strate...
متن کاملArchitecture-Based Self-Adaptation for Moving Target Defense (CMU-ISR-14-109)
The fundamental premise behind Moving Target Defense (MTD) is to create a dynamic and shifting system that is more difficult to attack than a static system because a constantly changing attack surface at least reduces the chance of an attacker finding and exploiting the weakness. However, MTD approaches are typically chosen without regard to other qualities of the system, such as performance or...
متن کاملArchitecture-Based Self-Adaptation for Moving Target Defense
Architecture-Based Self-Adaptation for Moving Target Defense Report Title The fundamental premise behind Moving Target Defense (MTD) is to create a dynamic and shifting system that is more difficult to attack than a static system because a constantly changing attack surface at least reduces the chance of an attacker finding and exploiting the weakness. However, MTD approaches are typically chos...
متن کاملEquilibrium Selection through Incomplete Information in Coordination Games: An Experimental Study
We experiment on a coordination game with uncertainty about payoffs.This game is closely related to models used in macroeconomic and financial applications to solve equilibrium indeterminacy. Subjects receive noisy signals about the true payoffs. The unique equilibrium is reached by iterative deletion of strictly dominated strategies. Over time actual behavior converges to the equilibrium. The ...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کامل